Single-crossover recombination in discrete time
نویسندگان
چکیده
منابع مشابه
Single-crossover recombination in discrete time.
Modelling the process of recombination leads to a large coupled nonlinear dynamical system. Here, we consider a particular case of recombination in discrete time, allowing only for single crossovers. While the analogous dynamics in continuous time admits a closed solution (Baake and Baake in Can J Math 55:3-41, 2003), this no longer works for discrete time. A more general model (i.e. without th...
متن کاملSingle-crossover recombination and ancestral recombination trees.
We consider the Wright-Fisher model for a population of [Formula: see text] individuals, each identified with a sequence of a finite number of sites, and single-crossover recombination between them. We trace back the ancestry of single individuals from the present population. In the [Formula: see text] limit without rescaling of parameters or time, this ancestral process is described by a rando...
متن کاملDeterministic and stochastic aspects of single-crossover recombination
This contribution is concerned with mathematical models for the dynamics of the genetic composition of populations evolving under recombination. Recombination is the genetic mechanism by which two parent individuals create the mixed type of their offspring during sexual reproduction. The corresponding models are large, nonlinear dynamical systems (for the deterministic treatment that applies in...
متن کاملUnequal crossover dynamics in discrete and continuous time.
We analyze a class of models for unequal crossover (UC) of sequences containing sections with repeated units that may differ in length. In these, the probability of an 'imperfect' alignment, in which the shorter sequence has d units without a partner in the longer one, scales like qd as compared to 'perfect' alignments where all these copies are paired. The class is parameterized by this penalt...
متن کاملDiscrete { Time Two Dimensional Single Input
This paper presents a complete characterization of control-lability and reachability for the class of discrete{time recurrent neural networks with state space dimension 2 and single input. Under certain assumption on the matrix A and B we prove that any point in the state space can be reached in at most time 2. Furthermore we give a characterization of the set of reachable points.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Biology
سال: 2009
ISSN: 0303-6812,1432-1416
DOI: 10.1007/s00285-009-0277-4